Generalized Fibonacci Sequences Generated from a $k$--Fibonacci Sequence
نویسندگان
چکیده
منابع مشابه
On Periodic ∞-generalized Fibonacci Sequences
The notion of an∞-generalized Fibonacci sequence has been introduced in [6], and studied in [1], [7], [9]. This class of sequences defined by linear recurrences of infinite order is an extension of the class of ordinary (weighted) r-generalized Fibonacci sequences (r-GFS, for short) with r finite defined by linear recurrences of r order (for example, see [2], [3], [4], [5], [8] etc.) More preci...
متن کاملGeneralized (k, r)–Fibonacci Numbers
In this paper, and from the definition of a distance between numbers by a recurrence relation, new kinds of k–Fibonacci numbers are obtained. But these sequences differ among themselves not only by the value of the natural number k but also according to the value of a new parameter r involved in the definition of this distance. Finally, various properties of these numbers are studied.
متن کاملRestricted Permutations, Fibonacci Numbers, and k-generalized Fibonacci Numbers
In 1985 Simion and Schmidt showed that the number of permutations in Sn which avoid 132, 213, and 123 is equal to the Fibonacci number Fn+1. We use generating function and bijective techniques to give other sets of pattern-avoiding permutations which can be enumerated in terms of Fibonacci or k-generalized Fibonacci numbers.
متن کاملThe generalized order-k Fibonacci–Pell sequence by matrix methods
In this paper, we consider the usual and generalized order-k Fibonacci and Pell recurrences, thenwe define a new recurrence, which we call generalized order-k F–P sequence. Also we present a systematic investigation of the generalized order-k F–P sequence. We give the generalized Binet formula, some identities and an explicit formula for sums of the generalized order-k F–P sequence by matrix me...
متن کاملPower of Two–Classes in k–Generalized Fibonacci Sequences Clases de potencias de dos en sucesiones k–generalizadas de Fibonacci
The k-generalized Fibonacci sequence ( F (k) n ) n≥2−k is the linear recurrent sequence of order k, whose first k terms are 0, . . . , 0, 1 and each term afterwards is the sum of the preceding k terms. Two or more terms of a k-generalized Fibonacci sequence are said to be in the same power of two-class if the largest odd factors of the terms are identical. In this paper, we show that for each k...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Mathematics Research
سال: 2012
ISSN: 1916-9809,1916-9795
DOI: 10.5539/jmr.v4n2p97